A Comrade-Matrix-Based Derivation of the Eight Versions of Fast Cosine and Sine Transforms

نویسندگان

  • Alexander Olshevsky
  • Vadim Olshevsky
  • Jun Wang
  • JUN WANG
چکیده

The paper provides a full self-contained derivation of fast algorithms to compute discrete Cosine and Sine transforms I IV. For the Sine I/II and Cosine I/II transforms a unified derivation based on the concept of the comrade matrix is presented. The comrade matrices associated with different versions of the transforms differ in only a few boundary elements; hence, in each case algorithms can be derived in a unified manner. The algorithm is then modified to compute Sine III/IV and Cosine III/IV transforms as well. The resulting algorithms for the versions III/IV are direct and recursive, such algorithms were missing in the existing literature. Finally, formulas reducing Cosine and Sine transforms of the types III and IV to each other are presented. Part I: Versions I and II Of The Transforms

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Sine-Cosine Wavelet and Its Application in the Optimal Control of Nonlinear Systems with Constraint

In this paper, an optimal control of quadratic performance index with nonlinear constrained is presented. The sine-cosine wavelet operational matrix of integration and product matrix are introduced and applied to reduce nonlinear differential equations to the nonlinear algebraic equations. Then, the Newton-Raphson method is used for solving these sets of algebraic equations. To present ability ...

متن کامل

HYBRID COLLIDING BODIES OPTIMIZATION AND SINE COSINE ALGORITHM FOR OPTIMUM DESIGN OF STRUCTURES

Colliding Bodies Optimization (CBO) is a population-based metaheuristic algorithm that complies physics laws of momentum and energy. Due to the stagnation susceptibility of CBO by premature convergence and falling into local optima, some meritorious methodologies based on Sine Cosine Algorithm and a mutation operator were considered to mitigate the shortcomings mentioned earlier. Sine Cosine Al...

متن کامل

Modified Sine-Cosine Algorithm for Sizing Optimization of Truss Structures with Discrete Design Variables

This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical function...

متن کامل

The Discrete Trigonometric Transforms and Their Fast Algorithms: an Algebraic Symmetry Perspective

It is well-known that the discrete Fourier transform (DFT) can be characterized as decomposition matrix for the polynomial algebra C [x℄=(xn 1). This property gives deep insight into the DFT and can be used to explain and derive its fast algorithms. In this paper we present the polynomial algebras associated to the 16 discrete cosine and sine transforms. Then we derive important algorithms by m...

متن کامل

Calculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms

The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003